A Normal Form for XML Documents Marcelo Arenas Department of Computer Science University of Toronto Joint work with Leonid Libkin

Source URL: web.ing.puc.cl

• Technical communication
• XML
• Computing
• OSI protocols
• Markup languages

BRICS RSBiernacka & Danvy: A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Applied mathematics
• Models of computation
• Computability theory
• Explicit substitution
• Reduction strategy
• Operational semantics
• Beta normal form
• Overlap
• Formal language
• Mathematics
• Theoretical computer science
• Lambda calculus

BRICS RSO. Danvy: From Reduction-Based to Reduction-Free Normalization BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Computability theory
• Formal languages
• Logic in computer science
• Lambda calculus
• Models of computation
• Reduction strategy
• Standard ML
• Function
• Normal form
• Theoretical computer science
• Mathematics
• Programming language theory

The Evolution of Strategic Sophistication* Nikolaus Robalino Arthur J. Robson December 2, 2014 Abstract. This paper investigates the evolutionary foundation for our ability to attribute preferences to others, an ability

Source URL: econ.ucsb.edu

• Economics
• Outcome
• Subgame
• Normal-form game
• Science
• Strategic dominance
• Nash equilibrium
• Bayesian game
• Game theory
• Problem solving
• Extensive-form game

Skolemization in Simple Type Theory: the Logical and the Theoretical Points of View Gilles Dowek Peter Andrews has proposed, in 1971, the problem of finding an analog

Source URL: who.rocq.inria.fr

• Model theory
• Predicate logic
• Semantics
• Lambda calculus
• Logic in computer science
• First-order logic
• Skolem normal form
• Interpretation
• Function
• Logic
• Mathematical logic
• Mathematics

Typed Normal Form Bisimulation for Parametric Polymorphism Soren B. Lassen Google, Inc. Paul Blain Levy

Source URL: www.cs.bham.ac.uk

• Lambda calculus
• Computability theory
• Fixed-point combinator
• Combinatory logic
• Sheaf
• Theoretical computer science
• Mathematics
• Applied mathematics

Econometrica, Vol. 71, No. 6 (November, 2003), 1619–1660 LONG CHEAP TALK1 BY ROBERT J. AUMANN AND SERGIU HART With cheap talk, more can be achieved by long conversations than by a single message—even when one side i

Source URL: www.ppge.ufrgs.br

• Cheap talk
• Outcome
• Nash equilibrium
• Extensive-form game
• Repeated game
• Battle of the sexes
• Solution concept
• Normal-form game
• Game theory
• Problem solving
• Economics

Computing Persistent Homology ∗ Afra Zomorodian

Source URL: www.ayasdi.com

• Algebraic topology
• Smith normal form
• Simplicial homology
• Homology
• Spectral sequence
• Chain complex
• Simplicial complex
• Simplex
• Gaussian elimination
• Algebra
• Mathematics
• Topology

GUARDED TRANSFORMATION FOR THE MODAL µ-CALCULUS FLORIAN BRUSE, OLIVER FRIEDMANN, AND MARTIN LANGE Abstract. Guarded normal form requires occurrences of fixpoint variables in a µ-calculus-formula to occur under the scop

Source URL: files.oliverfriedmann.de

• Mathematical logic
• Metalogic
• Well-formed formula
• Conjunctive normal form
• Polynomial
• Parity
• Physics
• Formal languages
• Logical syntax

SIS Request Form This form is required if the user needs access to the SIS (Student Information System), for any access other than normal student access. Any faculty, including adjunct faculty must have a SIS Request Fo

Source URL: www.dcc.vccs.edu